Construction of Pushout Complements in the Category of Hypergraphs
نویسندگان
چکیده
We describe a concrete construction of all pushout complements for two given morphisms f : A→ B, m : B→ D in the category of hypergraphs, valid also for the case where f ,m are non-injective. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show how well-known coefficients from combinatorics, such as the Bell numbers, can be recovered. Furthermore we present a formula that can be used to compute the number of pushout complements for two given morphisms.1
منابع مشابه
Gcm 2010
We describe a concrete construction of all pushout complements for two given morphisms f : A → B, m : B → D in the category of hypergraphs, valid also for the case where f, m are non-injective. To our knowledge such a construction has not been discussed before in the literature. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show...
متن کاملHow to delete categorically - Two pushout complement constructions
In category theory, most set-theoretic constructions—union, intersection, etc.—have direct categorical counterparts. But up to now, there is no direct construction of a deletion operation like the set-theoretic complement. In rule-based transformation systems, deletion of parts of a given object is one of the main tasks. In the double pushout approach to algebraic graph transformation, the cons...
متن کاملGCM 2010 The Third International Workshop on Graph Computation Models
We describe a concrete construction of all pushout complements for two given morphisms f : A → B, m : B → D in the category of hypergraphs, valid also for the case where f, m are non-injective. To our knowledge such a construction has not been discussed before in the literature. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show...
متن کاملHypergraph rewriting using conformisms
In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, is presented. In particular , we show the existence of the pushout of any pair of conformisms of hypergraphs...
متن کاملDistributed Graphs and Graph Transformation
The new approach of distributed graphs and graph transformation as developed in this article allows to use structured graph transformation on two abstraction levels, the network and the local level. The network level contains the description of the topological structures of a system. The local level covers the description of states and their transitions in local systems. Local state transitions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 39 شماره
صفحات -
تاریخ انتشار 2011